Basic Results on the Semantics of Accellera PSL 1.1 Foundation Language

نویسندگان

  • John Havlicek
  • Dana Fisman
  • Cindy Eisner
چکیده

A number of technical consequences of the formal definitions of the semantics of Accellera PSL 1.1 Foundation Language are proved. These include direct characterizations of the semantics of derived LTL operators, duality of until operators, and the semantic correspondences that underly the clock rewrite rules given in Appendix B of the Accellera PSL 1.1 Language Reference Manual. The Prefix/Extension Theorem of [4] is shown to hold for PSL 1.1 Foundation Language. Results concerning the weak and strong promotions of boolean expressions and of Sequential Extended Regular Expressions to formulas are also proved. This work has supported the analysis and review of the formal semantics of PSL 1.1 Foundation Language and the effort to achieve semantic alignment between Accellera SystemVerilog 3.1 Assertions and PSL 1.1 Foundation Language.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving

The Accellera Property Specification Language (PSL) is designed for the formal specification of hardware. The Reference Manual contains a formal semantics, which we previously encoded in a machine readable version of higher order logic. In this paper we describe how to ‘execute’ the formal semantics using proof scripts coded in the HOL theorem prover’s metalanguage ML. The goal is to see if it ...

متن کامل

IEEE 1850 PSL: The Next Generation

The Accellera Property Specification Language (PSL) was developed to provide a standard assertion language for use in both simulation and formal verification tools and in the context of a variety of hardware description languages. After four years of development in Accellera, PSL has now been transferred to the IEEE for standardization. This paper presents an overview of the IEEE 1850 PSL activ...

متن کامل

Introduction to the New Accellera Open Verification Library

The new Accellera Open Verification Library (OVL) standard fulfills the long-anticipated vision of creating a vendorand language-independent assertion library that can be leveraged across multiple verification processes. In this paper, we present the new Accellera OVL standard, which is a completely re-architected version of the original OVL that takes advantage of new features offered by the e...

متن کامل

Proposal for Accellera PSL Temporal Layer Formal Syntax and Semantics

This document describes a proposal for the formal syntax and semantics of Accellera PSL. The clocked semantics for the ltl subset follows the paper [5], with the exception that strength is applied at the boolean level rather than at the propositional level. The clocked semantics for SEREs is very similar to the one in the LRM version 1.01 [2]. The main difference is a correction of the clocked ...

متن کامل

Automata Construction for PSL

The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the process of becoming an IEEE standard. The core of PSL, denoted here LTL WR, is an extension of the linear temporal logic LTL. The extension takes two orthogonal directions. In one direction the logic is interpreted over finite, possibly truncated, as well as infinite words....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004